COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	\area {Artificial Intelligence}
C00010 ENDMK
C⊗;
\area {Artificial Intelligence}

\problem Theorem proving (5)
 
It has been suggested that work on theorem proving has been
shelved temporarily.  Supposing this is correct, what would be the 
reason for this trend?  State your answer briefly.

\problem Production systems (5)

Comment briefly on the differences between production system
architectures when used for (a) psychological models of cognitive
skills (such as PSG) and (b) expert systems (such as MYCIN or AM).

\problem Performance (5)

Pick ONE of the pairs of programs listed below and 
contrast the approaches used in the two programs of that pair.  
In light of the superior performance of the "less intelligent" program,
defend the continued use of AI in such problem areas.
\hline
  a)	HEARSAY  - DRAGON
\hline
  b)	CHESS 4.6 [or 4.5 or 4.7] - CAPS
\hline
  c)	INTERNIST [Pople's early version] - MYCIN

\problem Choice of Task Domain (9)

Order the tasks below by the time it will take to produce
commercial robots to do them.  State the general principles you use to
make the ordering and explain any exceptions.
\hline
	Planning a meal
\hline
	Cooking a meal
\hline
	Serving a meal
\hline
	Teaching arithmetic
\hline
	Teaching soccer
\hline
 	Teaching (about) Shakespeare

\problem Concepts (9)

Briefly define each of the following AI concepts 
and methods, and give a one or two sentence description of the conditions 
under which it is relevant:
\hline
	actors
\hline
	alpha-beta technique
\hline
	British Museum algorithm
\hline
	goal-directed search
\hline
	LISP
\hline
	Simon's ant

\problem Games (27)

Consider the following problem:
\hline {\sl
	You and an opponent are facing 11 stacks of pennies, of heights
    11,10,9,...,1.  You will alternate moves, removing pennies, and
    each time someone takes the final penny in a stack his OPPONENT
    will receive one point.  During his turn, each player must remove
    three pennies (three from one pile, two from one pile and one from
    another, or one each from three separate piles).  What should be
    your first move?  (Assume that your opponent will play perfectly,
    that you are trying to maximize the number of points you will
    receive, that your program can have as much time and space as it
    calls for, etc.)}
\hline

\noindent (a) [10 points] Sketch the body of a recursive program to solve
this problem.  You may omit the details, and use math notation and concepts
liberally.

\noindent (b) [7 points] Clean up the above sketch: fill in the details, such
as the base steps of the recursion, the initialization of any necessary variables
and data structures, etc.

\noindent (c) [2 points] What language might be appropriate to implement this
program in (very briefly mention why)? 
(Discuss this, don't try to rewrite your program)

\noindent (d) [4 points] Assume that, rather than being infallible, your
opponents are many and varied in their skill. How might "intelligence" be
inserted into the program so that it might attain very high scores?
(Discuss this, don't try to modify your program)

\noindent (e) [4 points] How might a software analogue of "caching" be used
to improve the program's efficiency?  (If you prefer, you may
answer this question using the software analogue
of any other hardware concept.)
(Discuss this, don't try to modify your program)